Refine your search
Collections
Co-Authors
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Ravi, T.
- Dynamic Channel Allocation for Multipath Cellular Networks Using MSWF in Wireless Network
Abstract Views :416 |
PDF Views:102
Authors
P. Jesu Jayarin
1,
T. Ravi
2
Affiliations
1 CSE Department, Sathyabama University, Chennai-600119, IN
2 Department of CSE, KCG College of Technology, Chennai-600097, IN
1 CSE Department, Sathyabama University, Chennai-600119, IN
2 Department of CSE, KCG College of Technology, Chennai-600097, IN
Source
Indian Journal of Science and Technology, Vol 3, No 12 (2010), Pagination: 1202-1207Abstract
In multi-hop cellular networks, a channel that contributes the lowest relaying delay is proposed to the current node on the path. The current node itself does not receiving on the time-slot of the proposed channel that enhance the capacity and coverage problems of cellular networks. They also allow faster and cheaper deployment of cellular networks. A fundamental issue of these networks is packet delay because multi-hop relaying for signals is involved. An effective channel assignment is the key for the reducing delay. It proposes an optimal and a heuristic channel assignment scheme, called OCA and minimum slot waiting first (MSWF) respectively, for a time division duplex (TDD) wideband code division multiple access (W-CDMA) MCN. OCA provides an optimal solution in minimizing packet delay and can be used as an unbiased or benchmark tool for comparison among different network conditions or networking schemes. However, OCA is computationally expensive and thus, inefficient for large real-time channel assignment problem. In this case, MSWF is more appropriate. Simulation results show that MSWF achieves on average 95% of the delay performance of OCA and is effective in achieving high throughput and low packet delay in conditions of different cell sizes. For improving more on quality of service we can propose channel reuse. Using FDMA and TDMA we can reuse the channels. The novel feature of the proposed technique is that co-coordinated, prioritized TDMA is supported for clusters of access points (AP's) using measurement based time slot assignments.Keywords
Cellular Network, MSWF, CSMA, OCA, Channel AssignmentReferences
- Aggelou GN and Tafazolli R (2001) On the relaying capacity of next generation GSM cellular networks. IEEE Personal Comm. 8(1), 40-47.
- Al-Ayyoub M and Gupta H (2010) Joint routing, channel assignment and scheduling for throughput maximization in general interference models. IEEE Trans. Mobile Computing. 9(4), 553-565.
- Al-Riyami M, Safwat AM and Hassanein HS (2005) Channel assignment in Multi-Hop TDD W-CDMA cellular networks. Proc. IEEE Intl. Conf. Comm. (ICC ’05). pp: 428-1432.
- Bre´laz D (1979) New methods to colour the vertices of a graph. Comm. ACM. 22(4), 251-256.
- Chafekar D and Maratge M (2008) Approximation algorithm for computing capacity of wireless networks with SINR constraints. Proc. IEEE INFOCOM.
- De S, Tonguz O, Wu H and Qiao C (2002) Integrated cellular and ad hoc relay (iCAR) systems: Pushing the performance limits of conventional wireless networks. Proc. IEEE Hawaii, Int. Conf. System Sci. (HICSS ’02), pp: 3899-3906.
- Fu X, Bourgeois AG, Fan P and Pan Y (2006) Using a genetic algorithm approach to solve the dynamic channel-assignment problem. Int. J. Mobile Comm. 4(3), 333-353.
- Holma H and Toskala A (2004) WCDMA for UMTS, radio access for third generation mobile communications. 3rd ed. John Wiley & Sons.
- Li XJ and Chong PHJ (2008) A dynamic channel assignment scheme for TDMA-based Multi-hop cellular networks. IEEE Trans. Wireless Comm. 7(6), 1999-2003.
- Li XJ and Chong PHJ (2010) Performance analysis of Multi-hop cellular network with fixed channel assignment. Wireless Networks. 16, 511-526.
- Li XJ, Seet BC and Chong PHJ (2008) Multi-hop cellular networks: Technology and economics. Computer Networks. 52, (9), 1825-1837.
- Lin YD and Hsu YC (2000) Multihop cellular: A new architecture for wireless communications. Proc. IEEE INFOCOM. pp: 1273-1282.
- Noor L and Anpalagan A (2004) Dynamic channel allocation in TDD-CDMA systems. IEEE Canadian Rev. pp:9-11.
- Third generation partnership project (3GPP) (1999) Technical specification group radio access network. Opportunity driven multiple access (ODMA), Sophia Antipolis, Valbbonne (3G TR 25.924 Version 1.0.0).
- An Optimal Technique for Reducing the Effort of Regression Test
Abstract Views :482 |
PDF Views:0
Authors
T. Prem Jacob
1,
T. Ravi
2
Affiliations
1 Sathyabama University, Chennai-119, IN
2 Principal, Srinivasa Institute of Engineering & Technology, Chennai- 56, IN
1 Sathyabama University, Chennai-119, IN
2 Principal, Srinivasa Institute of Engineering & Technology, Chennai- 56, IN
Source
Indian Journal of Science and Technology, Vol 6, No 8 (2013), Pagination: 5065-5069Abstract
Regression test selection techniques are proposed often but are many times inaccurate when used with larger systems. The proposed new selection technique will be safer, more precise, and can handle the object-oriented features even in larger systems through its phases. Selecting the subset of the test case from the existing test suite is an important problem in regression testing and is addressed in the regression test selection technique. Safe regression test selection technique selects and identifies the program parts that are affected by the change. The test selection is performed by matching the identified change information with the coverage information. A tool is implemented that reduces the testing effort efficiently and the result shows that it can achieve considerable savings in the regression testing time.Keywords
Test Selection, Testing, Software Maintenance, Regression Testing, Software EvaluationReferences
- Rothermel G, Untch R H et al. (1999). Test case prioritization: an empirical study, Proceedings of the International Conference on Software Maintenance, 179–188.
- Jacob T P (2013). Regression testing: Tabu search technique for code coverage, Indian Journal of Computer Science and Engineering, vol 4, No.3, 208–215.
- Elbaum S, Rothermel G et al. (2004). Selecting a cost-effective test case prioritization technique, Software Quality Control, vol 12, No. 3, 185–210.
- Jacob T P, and Ravi T (2013). Optimal regression test case prioritization using genetic algorithm, Life Science Journal, vol 10(3), 1021–1033.
- Rothermel G, and Harrold M J (1997). A safe, efficient regression test selection technique. ACM TOSEM, vol 6(2), 173–210.
- Bible J, Rothermel G et al. (2001). A comparative study of coarse and fine-grained safe regression test selection techniques. ACM TOSEM, vol 10(2), 149–183.
- Walcott K R, Soffa M L et al. (2006). Time-aware test suite prioritization, International Symposium on Software Testing and Analysis, 1–11.
- Do H, Elbaum S G et al. (2005). Supporting controlled experimentation with testing techniques: an infrastructure and its potential impact, Empirical Software Engineering, vol 10(4), 405–435.
- Li Z, Harman M et al. (2007). Search algorithm for regression test case prioritization, IEEE Transactions on Software Engineering, vol 33, No. 4, 5–7.
- Jeffrey D, and Gupta N (2007). Improving fault detection capability by selectively retaining test cases during test suite reduction, IEEE Transactions on software Engineering, vol 33, No. 2, 122–127.
- Li Z, Harman M et al. (2007). Search algorithms for regression test case prioritization, IEEE Transactions on Software Engineering, vol 33, No. 4, 225–237.
- Kim J M, and Porter A (2002). A history-based test prioritization technique for regression testing in resource constrained environments, Proceedings of the 24th International Conference on Software Engineering, 119–129.
- A Novel 8 Bit Digital Comparator for 3x3 Fixed Kernel Based Modified Shear Sorting
Abstract Views :303 |
PDF Views:0
Authors
Affiliations
1 Department of E.E.E, Sathyabama University, Chennai-119, Tamil Nadu, IN
2 Department of E.C.E, Sathyabama University, Chennai-119, Tamil Nadu, IN
1 Department of E.E.E, Sathyabama University, Chennai-119, Tamil Nadu, IN
2 Department of E.C.E, Sathyabama University, Chennai-119, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 7, No 4 (2014), Pagination: 452-462Abstract
The need for an optimized area, speed and power plays a vital role for any median filter is good at removing impulse noise without degrading the image details. The main operation of the median is Rank ordering. It is a computationally complex operation, so it is hard to implement it in real time. This paper introduces a new sorting technique called for Snake like sorting. The proposed Sorting technique is implemented as a parallel architecture. This algorithm is a Mesh based sorting that require less number of comparators for rank ordering. The proposed architecture is compared with other Rank Ordering algorithm on the basis of power, speed, and area and found to exhibit good results. The proposed architecture is implemented on parallel and pipelined schemes and is targeted for Spartan 3e Device with gate capacity 5000 using Xilinx 7.1i compiler version. The pipelined scheme has an operating frequency of 81 Mhz occupying 283 slices with a gate count of 5,640.Keywords
Borrow Look Ahead Select Comparator, Median Filter, Modified Shear Sorting, Salt And Pepper Noise- A Novel Technique for Multi-Class Ordinal Regression-APDC
Abstract Views :208 |
PDF Views:0
Authors
Affiliations
1 Sathyabama University, Rajiv Gandhi Road, Jeppiaar Nagar, Chennai - 600119, Tamil Nadu, IN
2 Karapagam College of Engineering, Myleripalayam Village, Othakkal Mandapam Post, Coimbatore - 641032, Tamil Nadu, IN
3 Madanapalle Institute of Technology and Science, P.B. No:14, Kadiri Road, Angallu Village, Chittoor District, Madanapalle - 517325, Andhra Pradesh, IN
1 Sathyabama University, Rajiv Gandhi Road, Jeppiaar Nagar, Chennai - 600119, Tamil Nadu, IN
2 Karapagam College of Engineering, Myleripalayam Village, Othakkal Mandapam Post, Coimbatore - 641032, Tamil Nadu, IN
3 Madanapalle Institute of Technology and Science, P.B. No:14, Kadiri Road, Angallu Village, Chittoor District, Madanapalle - 517325, Andhra Pradesh, IN
Source
Indian Journal of Science and Technology, Vol 9, No 10 (2016), Pagination:Abstract
Objectives: Ordinal regression is one which is used in Multiclass classification where there is an essential ordering among the classes. The training dataset is initially classified depending on the Random threshold values θ. Based on these values, the distance between the different class labels are predicted by one against one technique. Method: All Pairs Distance Calculation using one against one technique [APDC_1 AG 1] is Proposed to validate the work. But in the referred previous work, distance is calculated using adjacent classes, but here all pairs distance calculation is used to find the class label distance to all class label pairs. Findings: On the whole, New trained data are in the form of one dimensional representation. Here, with the knowledge of proposed work, testing data is tested with New trained data set and the results are produced. The Proposed method is seen to be ambitious when compared with previous work. Beside this, an additional set of experiments is done to study the potential quantifiability and illustratability of the proposed method when using APDC as base methodology. Improvements: Proposed work is analyzed with Kernel discriminant analysis, Logistic Regression, Classification via Regression, Multiclass Classifier and found APDC has attained better results according to all measures.Keywords
All Pairs Distance Calculations, Hyper Line, Latent Space Representation, Multi-Class Ordinal Regression, One Against One Method, Ordinal Classification, Projection- Alleviate the Parental Stress in Neonatal Intensive Care Unit using Ontology
Abstract Views :146 |
PDF Views:0
Authors
A. Velmurugan
1,
T. Ravi
2
Affiliations
1 Department of Computer Science and Engineering, Sathyabama University, Chennai, IN
2 Department of Computer Science and Engineering, Madanapallee Institute of Technology and Science, Andhra Pradesh, IN
1 Department of Computer Science and Engineering, Sathyabama University, Chennai, IN
2 Department of Computer Science and Engineering, Madanapallee Institute of Technology and Science, Andhra Pradesh, IN